A comparative multiobjective programming study
نویسندگان
چکیده
منابع مشابه
Programming Languages: A Comparative Study
In this paper we present a survey on programming languagesC++, Perl, Lisp and java. Our survey work involves a comparative study of these programming languages with respect to the following parameters like: Reusability, Portability, Reliability, Readability, Efficiency, Availability of compilers and tools, Familiarity and Expressiveness. At the end, a study of these languages has been made by c...
متن کاملMultiobjective Optimization Using Evolutionary Algorithms - A Comparative Case Study
Since 1985 various evolutionary approaches to multiobjec-tive optimization have been developed, capable of searching for multiple solutions concurrently in a single run. But the few comparative studies of diierent methods available to date are mostly qualitative and restricted to two approaches. In this paper an extensive, quantitative comparison is presented, applying four multiobjective evolu...
متن کاملMultiobjective Simulated Annealing: A Comparative Study to Evolutionary Algorithms
As multiobjective optimization problems have many solutions, evolutionary algorithms have been widely used for complex multiobjective problems instead of simulated annealing. However, simulated annealing also has favorable characteristics in the multimodal search. We developed several simulated annealing schemes for the multiobjective optimization based on this fact. Simulated annealing and evo...
متن کاملA comparative study of metamodeling methods for multiobjective crashworthiness optimization
The response surface methodology (RSM), which typically uses quadratic polynomials, is predominantly used for metamodeling in crashworthiness optimization because of the high computational cost of vehicle crash simulations. Research shows, however, that RSM may not be suitable for modeling highly nonlinear responses that can often be found in impact related problems, especially when using limit...
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1988
ISSN: 0895-7177
DOI: 10.1016/0895-7177(88)90085-4